A Novel Timestamp Ordering Approach for Co-existing Traditional and Cooperative Transaction Processing

نویسندگان

  • Yanchun Zhang
  • Yahiko Kambayashi
  • Yun Yang
  • Chengzheng Sun
چکیده

In order to support both traditional short transaction and long cooperative transactions, we propose a novel timestamp ordering approach. With this timestamp ordering method, short transactions can be processed in the traditional way, as if there are no cooperative transactions, therefore not be blocked by long transactions; cooperative transactions will not be aborted when there is a conflict with short transactions, rather, it will incorporate the recent updates into its own processing; and the serialisabilities, among short transactions, and between a cooperative transaction (group) and other short transactions, are all preserved.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Maintaining Data Consistency Using Timestamp Ordering in Real-Time Broadcast Environments

The broadcast-based data dissemination in wireless environments poses new challenging issues on data consistency of transaction processing. In this paper, we first adapt the optimistic concurrency control with forward validation to the broadcast environments. The adapted protocol gives autonomy between the mobile clients and the server such that the mobile clients can read consistent data off t...

متن کامل

On Transaction Processing with Partial Validation and Timestamp Ordering in Mobile Broadcast Environments

Conventional concurrency control protocols are inapplicable in mobile broadcast environments due to a number of constraints of wireless communications. Previous studies are focused on efficient processing of read-only transactions at the mobile clients, neglecting update transactions. In this paper, we design a new protocol for processing both read-only and update mobile transactions. The proto...

متن کامل

Performance Models for Perfect and Imperfect Clocks on Timestamp Ordering in Distributed Databases

This work presents a model of a distributed database system which provides the framework to study the performance of timestamp ordering concurrency control. We exhibit an analytical solution, which has been tested with extensive simulation. The accuracy seems to be very high. We assume perfect and also imperfect clocks for synchronization and quantify the way in which local clock inaccuracies a...

متن کامل

The Perfect and Imperfect Clocks Approach to Performance Analysis of Basic Timestamp Ordering in Distributed Databases

Locking and timestamping are two popular approaches to concurrency control in databases systems. Although more than a dozen analytic performance studies of locking techniques have recently appeared in the literature, analytic performance study of timestamp–based concurrency algorithms largely remains an unexplored area. This work presents a model of a distributed database system which provides ...

متن کامل

An efficient deadlock prevention approach for service oriented transaction processing

Transaction processing can guarantee the reliability of business applications. Locking resources is widely used in distributed transaction management (e.g., two phase commit, 2PC) to keep the system consistent. The lockingmechanism, however, potentially results in various deadlocks. In service oriented architecture (SOA), the deadlock problem becomes even worse because multiple (sub)transaction...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1998